翻訳と辞書 |
tolerant sequence : ウィキペディア英語版 | tolerant sequence In mathematical logic, a tolerant sequence is a sequence :,..., of formal theories such that there are consistent extensions :,..., of these theories with each interpretable in . Tolerance naturally generalizes from sequences of theories to trees of theories. Weak interpretability can be shown to be a special, binary case of tolerance. This concept, together with its dual concept of cotolerance, was introduced by (Japaridze ) in 1992, who also proved that, for Peano arithmetic and any stronger theories with effective axiomatizations, tolerance is equivalent to -consistency. == See also ==
*Interpretability *Cointerpretability *Interpretability logic
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「tolerant sequence」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|